A Partition Theorem for [0,1]
نویسندگان
چکیده
We prove a Hindman-type partition theorem for Baire partitions of [0, 1].
منابع مشابه
Feynman’s Operational Calculi: Decomposing Disentanglings
Let X be a Banach space and suppose that A1, . . . ,An are noncommuting (that is, not necessarily commuting) elements in L(X), the space of bounded linear operators on X. Further, for each i ∈ {1, . . . , n}, let μi be a continuous probability measure on B([0,1]), the Borel class of [0,1]. Each such n-tuple of operator-measure pairs (Ai,μi), i = 1, . . . , n, determines an operational calculus ...
متن کامل$L^p$-existence of mild solutions of fractional differential equations in Banach space
We study the existence of mild solutions for semilinear fractional differential equations with nonlocal initial conditions in $L^p([0,1],E)$, where $E$ is a separable Banach space. The main ingredients used in the proof of our results are measure of noncompactness, Darbo and Schauder fixed point theorems. Finally, an application is proved to illustrate the results of this work.
متن کاملThe Complexity of Weighted Boolean #CSP
This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterised by a finite set F of non-negative functions that may be used to assign weights to the configurations (feasible solutions) of a problem instance. Classical constraint satisfaction problems correspond to the ...
متن کاملThe existence results for a coupled system of nonlinear fractional differential equations with multi-point boundary conditions
In this paper, we study a coupled system of nonlinear fractional differential equations with multi-point boundary condi- tions. The differential operator is taken in the Riemann-Liouville sense. Applying the Schauder fixed-point theorem and the contrac- tion mapping principle, two existence results are obtained for the following system D^{alpha}_{0+}x(t)=fleft(t,y(t),D^{p}_{0+}y(t)right), t in (0,...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کامل